Application of Orthogonal Polynomial in Orthogonal Projection of Algebraic Surface

نویسندگان

چکیده

Point orthogonal projection onto an algebraic surface is a very important topic in computer-aided geometric design and other fields. However, implementing this method currently extremely challenging difficult because it to achieve desired degree of robustness. Therefore, we construct polynomial, which the ninth formula, after inner product eighth formula itself. Additionally, use Newton iterative for iteration. In order ensure maximum convergence, two techniques are used before iteration: (1) Newton’s gradient descent method, make initial iteration point fall on surface, (2) computation foot-point moving close position surface. Theoretical analysis experimental results show that proposed algorithm can accurately, efficiently, robustly converge test points different spatial positions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple orthogonal polynomial ensembles

Multiple orthogonal polynomials are traditionally studied because of their connections to number theory and approximation theory. In recent years they were found to be connected to certain models in random matrix theory. In this paper we introduce the notion of a multiple orthogonal polynomial ensemble (MOP ensemble) and derive some of their basic properties. It is shown that Angelesco and Niki...

متن کامل

Application of orthogonal array technique and particle swarm optimization approach in surface roughness modification when face milling AISI1045 steel parts

Face milling is an important and common machining operation because of its versatility and capability to produce various surfaces. Face milling is a machining process of removing material by the relative motion between a work piece and rotating cutter with multiple cutting edges. It is an interrupted cutting operation in which the teeth of the milling cutter enter and exit the work piece during...

متن کامل

Orthogonal Polynomials and Polynomial Approximations

3.1.1. Existence and uniqueness. Our immediate goal is to establish the existence of a sequence of orthogonal polynomials. Although we could, in principle, determine the coefficients a j of pn in the natural basis by using the orthogonality conditions (3.1.2), it is computationally advantageous to express pn in terms of lower-order orthogonal polynomials. Let us denote Pn := span { 1, x, x, · ·...

متن کامل

Filtering En Restarting Orthogonal Projection Methods Filtering En Restarting Orthogonal Projection Methods

We consider the class of the Orthogonal Projection Methods (OPM) to solve iteratively large and generalised eigenvalue problems. An OPM is a method that projects a large eigenvalue problem on a smaller subspace. In this subspace, an approximation of the eigenvalue spectrum can be computed from a small eigenvalue problem using a direct method. We show that many iterative eigenvalue solvers, such...

متن کامل

An Orthogonal Property of the Hypergeometric Polynomial.

1. Mittag-Leffler's polynomial gn(z) has the orthogonal property fgm(-ix)gn(ix)dx/xsh(x) = m $ n m > 0-co =-2/n m=n n>O. (1.1) This is readily obtained by inverting the integral representation' co gn(ix) = (1/ir) sin (irx)f exu (tanh '/2u)ndu/sh u n > 1 (1.2)-co0 by means of Fourier's inversion formula. The resulting equation co cosech u (tanh 1/2u)n = 1/2 e-iux cosech (irx)gn(ix)dx (1.3)-OD th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Axioms

سال: 2022

ISSN: ['2075-1680']

DOI: https://doi.org/10.3390/axioms11100544